The projection method for continuous-time consensus seeking
نویسندگان
چکیده
منابع مشابه
The projection method for continuous-time consensus seeking
For the case where the dependency digraph has no spanning in-tree, we characterize the region of convergence of the basic continuous-time distributed consensus algorithm and show that consensus can be achieved by employing the method of orthogonal projection, which has been proposed for the discrete-time coordination problem.
متن کاملRobust Consensus for Continuous-Time Multiagent Dynamics
This paper investigates consensus problems for continuous-time multiagent systems with time-varying communication graphs subject to input noise. Based on input-to-state stability and integral input-to-state stability, robust consensus and integral robust consensus are defined with respect to L∞ and L1 norms of the noise function, respectively. Sufficient and/or necessary connectivity conditions...
متن کاملContinuous-time consensus with discrete-time communications
This paper addresses the problem of reaching consensus among a group of agents that evolve in continuous-time and exchange information at discretetime instants, referred to as update times. Each agent has its own sequence of update times and therefore the agents are not required to keep synchronized clocks among them. At each update time, an agent receives from a subset of the other agents thei...
متن کاملContinuous time quantum consensus & quantum synchronisation
Distributed consensus algorithm over networks of quantum systems has been the focus of recent studies in the context of quantum computing and distributed control. Most of the progress in this category have been on the convergence conditions and optimizing the convergence rate of the algorithm, for quantum networks with undirected underlying topology. This paper aims to address the extension of ...
متن کاملStochastic stability of continuous time consensus protocols
A unified approach to studying convergence and stochastic stability of continuous time consensus protocols (CPs) is presented in this work. Our method applies to networks with directed information flow, both cooperative and noncooperative interactions, networks under weak stochastic forcing, and those whose topology and strength of connections may vary in time. The graph theoretic interpretatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automation and Remote Control
سال: 2015
ISSN: 0005-1179,1608-3032
DOI: 10.1134/s0005117915080081